The non-extensibility of $D(-2k+1)$-triples $\{1, k^2, k^2+2k-1\}$
نویسندگان
چکیده
منابع مشابه
Nonextendibility of D(-1)-triples of the form {1, 10, c}
Let n be an integer. A set of positive integers {a1,a2, . . . ,am} is said to have the property D(n) if aiaj +n is a perfect square for all 1 ≤ i < j ≤m. Such a set is called a Diophantine m-tuple (with the property D(n)) or a D(n)-m-tuple. In fact, this problem was first studied by Diophantus for the case n= 1 and he found a set of four positive rationals with the above property: {1/16,33/16,1...
متن کامل1 U ( 1 ) extensions of the SM and spectral triples
We study all possible U(1)-extensions of the standard model (SM) in the framework of noncommutative geometry (NCG) with the algebra H ⊕ C ⊕ C ⊕ M3(C). Comparison to experimental data about the mass of a hypothetical Z ′ gauge boson leads to the necessity of introducing at least one new family of heavy fermions. PACS-92: 11.15 Gauge field theories MSC-91: 81E13 Yang-Mills and other gauge theorie...
متن کاملSoliton-like Solutions of the Complex Non-linear Klein-Gordon Systems in 1 + 1 Dimensions
In this paper, we present soliton-like solutions of the non-linear complex Klein-Gordon systems in 1+1 dimensions. We will use polar representation to introduce three different soliton-like solutions including, complex kinks (anti-kinks), radiative profiles, and localized wave-packets. Complex kinks (anti-kinks) are topological objects with zero electrical charges. Radiative profiles are object...
متن کاملOn K2 of 1-dimensional local rings
We study K2 of one-dimensional local domains over a field of characterstic 0, introduce a conjecture, and show that this conjecture implies Geller’s conjecture. We also show that Berger’s conjecture implies Geller’s conjecture, and hence verify it in many new cases.
متن کاملCompressed k2-Triples for Full-In-Memory RDF Engines
Current “data deluge” has flooded the Web of Data with very large RDF datasets. They are hosted and queried through SPARQL endpoints which act as nodes of a semantic net built on the principles of the Linked Data project. Although this is a realistic philosophy for global data publishing, its query performance is diminished when the RDF engines (behind the endpoints) manage these huge datasets....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Miskolc Mathematical Notes
سال: 2015
ISSN: 1787-2405,1787-2413
DOI: 10.18514/mmn.2015.1012